Community Detection by using the Extended Modularity
نویسندگان
چکیده
منابع مشابه
Community Detection by using the Extended Modularity
This article is about community detection algorithms in graphs. First a new method will be introduced, which is based on an extension [16] of the commonly used modularity [17, 18, 19, 20] and gives overlapping communities. We list and compare the results given by our new method and some other algorithms yileding either overlapping or non-overlapping communities. While the main use of the propos...
متن کاملCommunity detection by modularity maximization using GRASP with path relinking
Detection of community structure in graphs remains up to this date a computationally challenging problem despite the efforts of many researchers from various scientific fields in the past few years. The modularity value of a set of vertex clusters in a graph is a widely used quality measure for community structure, and the relating problem of finding a partition of the vertices into clusters su...
متن کاملNetwork community detection using modularity density measures
Modularity, since its introduction, has remained one of the most widely used metrics to assess the quality of community structure in a complex network. However the resolution limit problem associated with modularity limits its applicability to networks with community sizes smaller than a certain scale. In the past various attempts have been made to solve this problem. More recently a new metric...
متن کاملModularity-based Dynamic Community Detection
Community detection is a fundamental problem in network science, which has attracted much attention in the past several decades, especially in the social network area. Lots of studies about detecting communities in the static networks have been proposed in the literature, which could be found in survey [1] and method [2]. Real-world networks, especially most of the social networks, however, are...
متن کاملGeneralized Modularity for Community Detection
Detecting the underlying community structure of networks is an important problem in complex network analysis. Modularity is a well-known quality function introduced by Newman, that measures how vertices in a community share more edges than what would be expected in a randomized network. However, this limited view on vertex similarity leads to limits in what can be resolved by modularity. To ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2011
ISSN: 0324-721X
DOI: 10.14232/actacyb.20.1.2011.6